A Golden Ratio Inequality for Vertex Degrees of Graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Vertex Degrees in Planar Graphs

For a planar graph on n vertices we determine the maximum values for the following: 1) the sum of the m largest vertex degrees. 2) the number of vertices of degree at least k. 3) the sum of the degrees of vertices with degree at least k.

متن کامل

Vertex Degrees in Outerplanar Graphs

For an outerplanar graph on n vertices, we determine the maximum number of vertices of degree at least k. For k = 4 (and n ≥ 7) the answer is n−4. For k = 5 (and n ≥ 4), the answer is ⌊

متن کامل

On the Zagreb index inequality of graphs with prescribed vertex degrees

For a simple graph G with n vertices and m edges, the inequality M1(G)/n ≤ M2(G)/m, where M1(G) and M2(G) are the first and the second Zagreb indices of G, is known as Zagreb indices inequality. According to this inequality, a set S of integers is good if for every graph whose degrees of vertices are in S, the inequality holds. We characterize that an interval [a, a+n] is good if and only if a ...

متن کامل

Random graphs with forbidden vertex degrees

We study the random graph Gn,λ/n conditioned on the event that all vertex degrees lie in some given subset S of the nonnegative integers. Subject to a certain hypothesis on S , the empirical distribution of the vertex degrees is asymptotically Poisson with some parameter b μ given as the root of a certain ‘characteristic equation’ of S that maximizes a certain function ψS(μ). Subject to a hypot...

متن کامل

Graphs (networks) with golden spectral ratio

We propose two new spectral measures for graphs and networks which characterize the ratios between the width of the ‘‘bulk’’ part of the spectrum and the spectral gap, as well as the ratio between spectral spread and the width of the ‘‘bulk’’ part of the spectrum. Using these definitions we introduce the concept of golden spectral graphs (GSG), which are graphs for which both spectral ratios ar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The American Mathematical Monthly

سال: 2019

ISSN: 0002-9890,1930-0972

DOI: 10.1080/00029890.2019.1627153